#include<iostream>
#include<vector>
#include<queue>
#include<cstring>
#include<cmath>
#include<map>
#include<set>
#include<cstdio>
#include<algorithm>
#define debug(a) cout<<#a<<"="<<a<<endl;
using namespace std;
const int maxn=2e5+100;
typedef long long LL;
inline LL read(){LL x=0,f=1;char ch=getchar();	while (!isdigit(ch)){if (ch=='-') f=-1;ch=getchar();}while (isdigit(ch)){x=x*10+ch-48;ch=getchar();}
return x*f;}
LL a[maxn];
LL p[23];
LL cnt[23];
int main(void)
{
  cin.tie(0);std::ios::sync_with_stdio(false);
  p[0]=1;
  for(LL i=1;i<=20;i++) p[i]=p[i-1]*2;
  LL n;cin>>n;
  for(LL i=1;i<=n;i++) cin>>a[i];
  for(LL i=1;i<=n;i++){
    for(LL j=20;j>=0;j--){
        if(a[i]&p[j]){
            cnt[j]++;
        }
    }
  }
  for(LL i=1;i<=n;i++) a[i]=0;
  for(LL j=20;j>=0;j--){
    for(LL i=1;i<=n;i++){
        if(cnt[j]){
            a[i]+=p[j];
            cnt[j]--;
        }
    }
  }
  LL sum=0;
  for(LL i=1;i<=n;i++){
      sum+=(a[i]*a[i]);
  }
  cout<<sum<<"\n";
return 0;
}
